Group strategy-proof social choice functions with binary ranges and arbitrary domains: characterization results
نویسندگان
چکیده
Wedefine different concepts of group strategy-proofness for social choice functions. We discuss the connections between the defined concepts under different assumptions on their domains of definition. We characterize the social choice functions that satisfy each one of them and whose ranges consist of two alternatives, in terms of two types of basic properties. Finally, we obtain the functional form of all rules satisfying our strongest version of group strategy-proofness.
منابع مشابه
Characterization of Domains Admitting Strategy-Proof and Non-Dictatorial Social Choice Functions with Infinite Sets of Alternatives
We show, with an example, that the theorem on the characterization of the domains admitting strategy-proof and non-dictatorial social choice functions by Kalai and Muller (1977) does not hold when the set of alternatives is infinite. We consider two ways of overcoming this problem. The first identifies a set of domains admitting strategy-proof and non-dictatorial social choice functions when th...
متن کاملDomains, ranges and strategy-proofness: the case of single-dipped preferences
We characterize the set of all individual and group strategy-proof rules on the domain of all single-dipped preferences on a line. For rules defined on this domain, and on several of its subdomains, we explore the implications of these strategy-proofness requirements on the maximum size of the rules’ range. We show that when all single-dipped preferences are admissible, the range must contain t...
متن کاملStrategy-proof social choice on multiple single- peaked domains and preferences for parties
The concept of single-peaked domains is generalized to multiple single-peaked domains, where the set of alternatives is equipped with several underlying orderings with respect to which a preference can be single-peaked. We provide a complete characterization of the strategy-proof social choice functions on multiple single-peaked domains. We show also in the framework of a spatial voting model f...
متن کاملThe Structure of Strategy-Proof Social Choice Part II: Non-Dictatorship, Anonymity and Neutrality*
Domains of generalized single-peaked preferences are classified in terms of the extent to which they enable well-behaved strategy-proof social choice. Generalizing the Gibbard-Satterthwaite Theorem, we characterize the domains that admit non-dictatorial strategy-proof social choice functions. We also provide characterizations of the domains that enable locally non-dictatorial, anonymous, and ne...
متن کاملOn domains that admit well-behaved strategy-proof social choice functions
In this paper, we investigate domains which admit “well-behaved”, strategy-proof social choice functions. We show that if the number of voters is even, then every domain that satisfies a richness condition and admits an anonymous, tops-only, unanimous and strategy-proof social choice function, must be semi-single-peaked. Conversely every semi-single-peaked domain admits an anonymous, tops-only,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Game Theory
دوره 41 شماره
صفحات -
تاریخ انتشار 2012